Back to course home
0% completed
Vote For New Content
LinkedIn Hard
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Coin Change
Introduction
Given an infinite supply of ānā coin denominations and a total money amount, we are asked to find the total number of distinct ways to make up that amount.
Example:
Denominations: {1,2,3}
Total amount: 5
Output: 5
Explanation: There are five ways to make the change for '5', here are those ways:
1. {1,1,1,1,1}
2. {1,1,1,2}
3. {1,2,2}
4. {1,1,3}
5. {2,3}
Problem Statement
Given a number array to represent different coin denominations and a total amount 'T', we need to find all the different ways to make a change for 'T' with the given coin denominations. We can assume an infinite supply of coins, therefore, each coin can be chosen multiple times.
Constraints:
1 <= coins.length <= 12- 1 <= coins[i] <= 231 - 1
- 0 <= amount <= 104
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: House Robber II
Solution: Coin Change
Mark as Completed
On this page
Introduction
Problem Statement
Try it yourself